General non-asymptotic and asymptotic formulas in channel resolvability and identification capacity and its application to wire-tap channel
نویسنده
چکیده
Several non-asymptotic formulas are established in channel resolvability and identification capacity. They are applied to wire-tap channel. By using them, the ǫ capacities of the above three problems are considered in the most general setting, where no structural assumptions such as the stationary memoryless property are made on a channel. As a result, we solve an open problem proposed in Han & Verdú[2] and Han [3]. Moreover, we obtain lower bounds of exponents of error probability and the wire-tapper’s information in wire-tap channel.
منابع مشابه
General non-asymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to wire-tap channel
Several non-asymptotic formulas are established in channel resolvability and identification capacity, and they are applied to wire-tap channel. By using these formulas, the ǫ capacities of the above three problems are considered in the most general setting, where no structural assumptions such as the stationary memoryless property are made on a channel. As a result, we solve an open problem pro...
متن کاملDoctoral Thesis Performance of Physical Layer Security under Correlated Fading Wire-Tap Channel
The inherent openness of wireless medium makes information security one of the most important and difficult problems in wireless networks. Physical layer security, which achieves the information-theoretic security by exploiting the differences between the physical properties of signal channels such that a degraded signal at an eavesdropper is always ensured and thus the original data can be har...
متن کاملApproximation theory of output statistics
Given a channel and an input process we study the minimum randomness of those input processes whose output statistics approximate the original output statistics with arbitrary accuracy. We introduce the notion of resolvability of a channel, defined as the number of random bits required per channel use in order to generate an input that achieves arbitrarily accurate approximation of the output s...
متن کاملAsymptotic Close to Optimal Resource Allocation in Centralized Multi-band Wireless Networks
This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate increases, where it is assumed each link is subject to a maximum transmit power constraint. This problem is found to be a non-convex optimization problem and i...
متن کاملVariable-Length Resolvability for Mixed Sources and its Application to Variable-Length Source Coding
In the problem of variable-length δ-channel resolvability, the channel output is approximated by encoding a variable-length uniform random number under the constraint that the variational distance between the target and approximated distributions should be within a given constant δ asymptotically. In this paper, we assume that the given channel input is a mixed source whose components may be ge...
متن کامل